Linear recurrences with constant coefficients: the multivariate case
نویسندگان
چکیده
While in the univariate case solutions of linear recurrences with constant coe cients have rational generating functions we show that the multivariate case is much richer even though initial conditions have rational generating functions the corresponding solutions can have generating functions which are algebraic but not rational D nite but not algebraic and even non D nite Introduction The aim of this paper is to study the nature of multivariate generating functions F x xd X n nd an ndx n xd d X
منابع مشابه
Multivariate linear recurrences and power series division
Bousquet-Mélou and Petkovšek investigated the generating functions of multivariate linear recurrences with constant coefficients. We will give a reinterpretation of their results by means of division theorems for formal power series, which clarifies the structural background and provides short, conceptual proofs. In addition, extending the division to the context of differential operators, the ...
متن کاملLinear Recurrences with Constant Coeecients: the Multivariate Case
While in the univariate case solutions of linear recurrences with constant coeecients have rational generating functions, we show that the multivariate case is much richer: even though initial conditions have rational generating functions, the corresponding solutions can have generating functions which are algebraic but not rational, D-nite but not algebraic, and even non D-nite.
متن کاملLinear Recurrences and Power Series Division
Bousquet-Mélou and Petkovšek investigated the generating functions of multivariate linear recurrences with constant coefficients. We will give a reinterpretation of their theory by means of division theorems for formal power series, which clarifies the structural background and provides short, conceptual proofs. In addition, extending the division to the context of differential operators, the c...
متن کاملGuessing Handbook
Introduction This package provides functions for discoverying linear recurrence equations with polynomial coefficients satisfied by the entries of a given array. It extends the functionality of existing packages like Mallinger's GeneratingFunctions.m or Salvy and Zimmermann's gfun in two directions: (1) it is more general in that, e.g., multivariate recurrences, or recurrences of a particular s...
متن کاملThe Combinatorialization of Linear Recurrences
We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 225 شماره
صفحات -
تاریخ انتشار 2000